Faust.rdf - Taking RDF literally
نویسنده
چکیده
This paper undertakes the modelling experiment of translating excerpts of the natural language play “Faust” by Johann Wolfgang von Goethe into a RDF structure, so that it is accessible by machines on a word or concept level. Thereby, it is crucial that statements made in the logic of the play can be distinguished from the usual, general purpose Linked Open Data. The goal is to find a standard compliant solution, stressing RDF’s central role in the Web of Data as a format for arbitrary data.
منابع مشابه
RDF Production from Municipal Wastes (Case Study: Babol City)
Today, with the advancement of technology, turning waste into fuel has been considered as an inexhaustible source of energy production, especially in industries with high energy consumption. The most important of these industries are Cement and Iron Smelting factories. Babol, as one of the largest provinces in the north of the country, has been facing waste management crisis for several years w...
متن کاملUnification of Geospatial Reasoning, Temporal Logic, & Social Network Analysis in an RDF Database
This paper is about a new type of event database that enables efficient reasoning about things, people, companies, relationships between people and companies, and about places and events. The event database is built on top of a scalable distributed RDF triple store that can handle literally billions of events. Like objects, events have at least one actor, but usually more, a start-time and poss...
متن کاملOn Explicit Provenance Management in RDF/S Graphs
The notion of RDF Named Graphs has been proposed in order to assign provenance information to data described using RDF triples. In this paper, we argue that named graphs alone cannot capture provenance information in the presence of RDFS reasoning and updates. In order to address this problem, we introduce the notion of RDF/S Graphsets: a graphset is associated with a set of RDF named graphs an...
متن کاملPRSP: A Plugin-based Framework for RDF Stream Processing
In this paper, we propose a plugin-based framework for RDF stream processing (PRSP). With this framework, we can apply SPARQL engines to process C-SPARQL queries with maintaining the high performance of those engines in a simple way. Taking advantage of PRSP, we can process large RDF streams in a distributed context via distributed SPARQL engines. Moreover, we can evaluate the performance and c...
متن کاملTaking the RDF Model Theory Out for a Spin
Entailment, as defined by RDF’s model-theoretical semantics, is a basic requirement for processing RDF, and represents the kind of “semantic interoperability” that RDF-based systems have been anticipated to have to realize the vision of the “Semantic Web”. In this paper we give some results in our investigation of a practical implementation of the entailment rules, based on the graph-walking qu...
متن کامل